Graphical Modeling of Recursion
نویسنده
چکیده
Recursion is a fundamental concept in computer science. Creating a correct mental model for the concept of recursion allows the understanding of recursive algorithms and their correct implementation. Teaching recursion is not an easy task for teachers. Generally, supporting abstract concepts through graphics leads to a better understanding of them. This paper presents a graphical application that allows the use of graphics in order to explain the concepts of recursion and trees.
منابع مشابه
Calculation for Energy of (111) Surfaces of Palladium in Tight Binding Model
In this work calculation of energetics of transition metal surfaces is presented. The tight-binding model is employed in order to calculate the energetics. The tight-binding basis set is limited to d orbitals which are valid for elements at the end of transition metals series. In our analysis we concentrated on electronic effects at temperature T=0 K, this means that no entropic term will be pr...
متن کاملMultiscale Graphical Modeling in Space: Applications to Command and Control
Recently, a class of multiscale tree-structured models was introduced in terms of scale-recursive dynamics deened on trees. The main advantage of these models is their association with a fast, recursive, Kalman-lter prediction algorithm. In this article, we propose a more general class of multiscale graphical models over acyclic directed graphs, for use in command and control problems. Moreover...
متن کاملDominance Order and Graphical Partitions
We gave a new criterion for graphical partitions. We derive a new recursion formula, which allows the computation of the number g(n) of graphical partitions of weight n for up to n > 900.
متن کاملMarginal conditional independence models with application to graphical modeling
Conditional independence models are defined by a set of conditional independence restrictions and play an important role in many statistical applications, especially, but not only, graphical modeling. In this paper we identify a subclass of these models which are hierarchical marginal log-linear, as defined by Bergsma and Rudas (2002a). Such models are smooth, which implies the applicability of...
متن کاملProbabilistic programs, computability, and de Finetti measures
The complexity of probabilistic models, especially those involving recursion, has far exceeded the representational capacity of graphical models. Functional programming languages with probabilistic choice operators have recently been proposed as universal representations for statistical modeling (e.g., IBAL [Pfe01], λ◦ [PPT08], Church [GMR08]). The conditional independence structure of a probab...
متن کامل